Knowledge Compilation of Logic Programs Using Approximation Fixpoint Theory published in Theory and Practice of Logic Programming BART BOGAERTS and GUY VAN DEN BROECK

Appendix A Figures This appendix contains some figures associated with the gear wheels example (Example 4.13). The first figure contains a circuit representation of the parametrised well-founded model of logic program P w from Example 4.13. turns1(0) turns2(0) turns1(1) turns2(1) Th(Aw) button1(0) button2(0) f f f f f f ∨ ∧ ∧ ¬ ¬ ∨ ∧ ∧ ¬ ¬ f f ∨ ∨ turns1(0) ⇔ turns2(0) ⇔ turns1(1) ⇔ turns2(1) ⇔ ∧ Fig. A 1. A circuit representation of the gear wheel theory Th(Aw). The next figure contains a circuit representation of the parametrised well-founded model of the following logic program P w,2 that represent the gear wheel example